Primitive Lattice Points in Starlike

نویسنده

  • Werner Georg Nowak
چکیده

This article is concerned with the number B D (x) of integer points with relative prime coordinates in p x D, where x is a large real variable and D is a starlike set in the Euclidean plane. Assuming the truth of the Riemann Hypothesis, we establish an asymptotic formula for B D (x). Applications to certain special geometric and arithmetic problems are discussed .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Starlike Functions of order α With Respect To 2(j,k)-Symmetric Conjugate Points

In this paper, we introduced and investigated starlike and convex functions of order α with respect to 2(j,k)-symmetric conjugate points and coefficient inequality for function belonging to these classes are provided . Also we obtain some convolution condition for functions belonging to this class.

متن کامل

On Neighborhoods of Strongly Starlike Functions of Order Α and Type Β with Respect to Symmetric Points

In this paper we introduce a class of strongly starlike functions of order α and type β with respect to symmetric points and investigate the neighborhoods and coefficients bounds of such functions.

متن کامل

Starlike and Convex Functions with Respect to Conjugate Points

An analytic functions f(z) defined on 4 = {z : |z| < 1} and normalized by f(0) = 0, f ′(0) = 1 is starlike with respect to conjugate points

متن کامل

Primitive Heronian Triangles With Integer Inradius and Exradii

It is well known that primitive Pythagorean triangles have integer inradius and exradii. We investigate the generalization to primitive Heronian triangles. In particular, we study the special cases of isosceles triangles and triangles with sides in arithmetic progression. We also give two families of primitive Heronian triangles, one decomposable and one indecomposable, which have integer inrad...

متن کامل

On the Pathwidth of Chordal Graphs

Gustedt, J., On the pathwidth of chordal graphs, Discrete Applied Mathematics 45 (1993) 233-248. In this paper we first show that the pathwidth problem for chordal graphs is NP-hard. Then we give polynomial algorithms for subclasses. One of those classes are the k-starlike graphs a generalization of split graphs. The other class are the primitive starlike graphs a class of graphs where the inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997